// -*- coding: utf-8 -*- 
/**
 * Project: LanQiao
 * Creator: yanking
 * Create time: 2022-02-20 16:17
 * IDE: IntelliJ IDEA
 * Introduction:
 */
package HuffmanTree;

import java.util.Arrays;
import java.util.Comparator;

public class test {
    public static void main(String[] args) {
        Integer[] ints = {1, 5, 6, 7, 8};
        Arrays.sort(ints, 1, ints.length, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2 - o1;
            }
        });
        for (int i = 0; i < ints.length; i++) {
            System.out.print(ints[i] + "\t");
        }

    }

}
